Method of assigning a spreading sequence to a user of a telecommunications network

ABSTRACT

An apparatus and method for a Multi-Carrier Code Division Multiple Access (“MC-CDMA”) transmission network is disclosed. In the MC-CDMA transmission network a plurality of spreading sequences are assigned to individual users from a plurality of predetermined spreading sequences. The spreading sequences are assigned to users in order to minimize the interference created by the assignment of spreading sequences.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention concerns a method of assigning a spreading sequence to a user of a telecommunications network, such as a Multi-Carrier Code Division Multiple Access transmission network, better known by the name MC-CDMA network.

2. Discussion of the Relevant Art

Among the new communication systems making it possible to manage, simultaneously and in one and the same frequency band, a number of communications between distinct users, the Multi-Carrier Code Division Multiple Access transmission technique, better known by the name MC-CDMA technique, is known. This transmission technique combines both the principles of Orthogonal Frequency Division Multiplex transmission known by the name OFDM and those of the Code Division Multiple Access (CDMA) technique.

FIG. 1 depicts a block diagram illustrating an example of the operation of a transmitter using the MC-CDMA transmission technique. This example represents an outgoing route transmission, that is to say from a base station to a mobile station. The n-th data item of the k-th user d^((k))[n] is fed to multipliers 10 to 1N−1 respectively provided for multiplying it by the elements c_(m) ^((k)) (m being between 0 and N−1) of a sequence referred to as a spreading sequence, and then to modulators 20 to 2N−1 for respectively modulating it on sub-carriers at the frequency (f_(c)+m.F/T_(b)) where f_(c) is the original frequency of the transmitted signal and F/T_(b) is the spacing between two consecutive sub-carriers, F being an integer and T_(b) being the duration of the data item d^((k))[n], excluding a guard interval. All the sub-carriers are added up in an adder 30 to form the transmitted signal s^((k))(n,t) which can therefore be expressed in the form: ${s^{(k)}\left( {n,t} \right)} = {{{d^{(k)}\lbrack n\rbrack}{\sum\limits_{m = 0}^{N - 1}{c_{m}^{(k)}{\cos\left\lbrack {2{\pi\left( {f_{c} + {m\frac{F}{T_{b}}}} \right)}t} \right\rbrack}\mspace{14mu}{if}\mspace{14mu} t}}} \Subset \left\lbrack {0,T_{b}} \right\rbrack}$

-   -   s^((k))(n,t)=0 otherwise

It should be noted that, in this particular example, the assembly of the modulators 20 to 2N−1 and of the adder 30 can be implemented by an inverse Fourier transform.

It should be noted that, for reasons of clarity, it has been considered that the length N of each spreading sequence is equal to the number M of modulation sub-carriers, which is not necessarily the case in all MC-CDMA systems.

The assumption has also been made, for reasons of clarity, that a single spreading sequence is assigned per user, which is not necessarily the case.

It is known that the propagation channel can be obstructed by houses and other obstacles situated between the transmitter and the receiver. The transmitted signal is then propagated on multiple paths, each path being delayed and attenuated differently. It should be understood that the propagation channel then acts as a filter whose transfer function h(f,t) varies with time.

The contribution denoted s_(m) to the transmitted signal s(n,t) of each carrier m of data items d intended for K users can be expressed as follows: $s_{m} = {\sum\limits_{k = 1}^{K}{d^{(k)}c_{m}^{(k)}}}$

In view of the complex attenuation denoted h_(m) ^((p)) induced by the transmission channel at the receiver of the user of rank p, the signal received, in the synchronous case and on the outgoing route, on each sub-carrier of rank m can then be expressed as follows: $r_{m}^{(p)} = {{h_{m}^{(p)}{\sum\limits_{k = 1}^{K}\left( {d^{(k)}c_{m}^{(k)}} \right)}} + n_{m}^{(p)}}$

-   -   where n_(m) ^((p)) represents the sample of additive white         Gaussian noise on the carrier of rank m.

The ability of MC-CDMA transmission systems to provide orthogonality between the signals of the different users in the network (and therefore to prevent any interference between these signals) depends on the intercorrelation properties of the spreading sequences which are assigned to the users of the network.

Typically, in the case of transmissions on a mobile radio channel from a base station to a set of mobile stations, the signals intended for each user are transmitted synchronously. Under these conditions, Walsh-Hadamard spreading sequences can be used to guarantee orthogonality between the users if the channel is not frequency selective.

In the known MC-CDMA systems, the assigning of spreading sequences does not, for one and the same family of spreading sequences (Walsh-Hadamard sequences of length N, Gold sequences, etc.), obey precise rules in order that the interference related to the frequency selectivity of the channel is minimized.

However, in actual fact, the present invention is based on the idea that the signal which is received by a receiver of an MC-CDMA system has a component which is related to the interference with the other users, interference which, contrary to what is commonly accepted, depends on the sequences assigned to these users in the same family of sequences used by the transmission system.

This is because, after unspreading, the signal v^((p)) received by the user p can be expressed in the form: $\begin{matrix} {v^{(p)} = {\sum\limits_{m = 1}^{N}{c_{m}^{(p)}\left\lbrack {{h_{m}^{(p)}{\sum\limits_{k = 1}^{K}\left( {d^{(k)}c_{m}^{(k)}} \right)}} + n_{m}^{(p)}} \right\rbrack}}} \\ {= {\sum\limits_{m = 1}^{N}\left( {{h_{m}^{(p)}{\sum\limits_{k = 1}^{K}\left( {c_{m}^{(p)}c_{m}^{(k)}d^{(k)}} \right)}} + z_{m}^{(p)}} \right)}} \\ {= {{d^{(p)}{\sum\limits_{m = 1}^{N}h_{m}^{(p)}}} + {\sum\limits_{{k = 1},{k \neq p}}^{K}{d^{(k)}{\sum\limits_{m = 1}^{N}\left( {h_{m}^{(p)}c_{m}^{(p)}c_{m}^{(k)}} \right)}}} + {\sum\limits_{m = 1}^{N}z_{m}^{(p)}}}} \end{matrix}$

It is assumed here that |c_(m) ^((p))|²=1 and the notation z_(m) ^((p))=n_(m) ^((p))×c_(m) ^((p)) is used.

It should be noted that three contributions are thus revealed in the expression of the signal received by the user p: the desired signal (first term), interference associated with the presence of other users (second term) and noise (third term).

The above relationship can also be written in the form: $v^{(p)} = {{d^{(p)}{\sum\limits_{m = 1}^{N}h_{m}^{(p)}}} + {\sum\limits_{{k = 1},{k \neq p}}^{K}{d^{(k)}{I\left( {h,p,k} \right)}}} + {\sum\limits_{m = 1}^{N}z_{m}^{(p)}}}$

-   -   where the term I(h,p,k) is an interference term representing all         the interference induced between the two sequences of index p         and k, taking into account the frequency selectivity of the         channel at the receiver of the user of the sequence of index p         and which is therefore equal to         $\sum\limits_{m = 1}^{N}{h_{m}^{(p)}c_{m}^{(p)}{c_{m}^{(k)}.}}$

In order to correct the effect of this interference with the other users, implementation is known, at the receiver, of an equalization step whose coefficient of equalization g_(m) takes a complex value which affects each carrier of rank m so that the apparent transfer function h′_(m) ^((p)) of the transmission channel seen by the receiver can be written in the form: h′ _(m) ^((p)) =h _(m) ^((p)) ×g _(m)

The modified interference term I′ (h, p, k) resulting from the fact of the distortion brought about by the transmission channel is now written: ${I^{\prime}\left( {h,p,k} \right)} = {\sum\limits_{m = 1}^{N}{h_{m}^{\prime{(p)}}c_{m}^{(p)}c_{m}^{(k)}}}$

A first simplistic approach to the equalization consists of making the apparent transfer function h′_(m) ^((p)) equal to 1 in order to completely restore orthogonality. However, this approach is not used since it increases the noise too much, which degrades the performance of the transmission system. In practice, the equalization provides a compromise between the restoration of orthogonality, that is to say the reduction of inter-user interference, and minimization of the effects of the noise. The interference is therefore never totally removed.

The aim of the invention is therefore to propose a method which makes it possible to attenuate the effects of the interference term (the second in the preceding equation) on the performance of the transmission system under consideration.

To that end, the present invention concerns a method of assigning one or more spreading sequences to a user of a Multi-Carrier Code Division Multiple Access transmission network. This method is characterised in that it consists of assigning, to the said user, the said spreading sequence or the said spreading sequences, taking into account a predetermined set of spreading sequences from among a set of possible sequences.

BRIEF DESCRIPTION OF THE DRAWINGS

The characteristics of the invention will emerge more clearly from a reading of the following description of an example embodiment, the said description being produced with reference to the accompanying drawings, among which:

FIG. 1 is a block diagram of an example of a transmitter of an MC-CDMA transmission system, and

FIG. 2 is an example of a graph showing the amplitude response of a receiver of an MC-CDMA system, and

FIG. 3 is a table giving the number of transitions of the element-by-element product of two Walsh-Hadamard sequences of length 8, the said table allowing the illustration of the method of the present invention.

DETAILED DESCRIPTION OF THE INVENTION

In an MC-CDMA transmission system, a user is assigned, either at the instant of the initiation of a call, or during communication, one or more spreading sequences, each element of which, at the transmitter of the system, is multiplied by the data item to be transmitted so as to control a modulator operating on a corresponding sub-carrier as has already been explained in the introduction to the present description.

The present invention consists of assigning this spreading sequence or these spreading sequences, taking into account a predetermined set of sequences, like for example the set of sequences already used, notably by other users at the instant under consideration and/or a set of sequences potentially usable in the future.

It is shown below, by means of a simplified example, that the assigning of sequences according to the present invention makes it possible to optimize the performance of the transmission system.

In this example, two active users are considered so that the received signal v^((p)) can be expressed as follows: $v^{(1)} = {{d^{(1)}{\sum\limits_{m = 1}^{N}h_{m}^{(1)}}} + {d^{(j)}{I\left( {h,1,j} \right)}} + {\sum\limits_{m = 1}^{N}z_{m}^{(1)}}}$ in the absence of equalization, and $v^{(1)} = {{d^{(1)}{\sum\limits_{m = 1}^{N}h_{m}^{(1)}}} + {d^{(j)}{I^{\prime}\left( {h,1,j} \right)}} + {\sum\limits_{m = 1}^{N}z_{m}^{\prime{(1)}}}}$ the presence of equalization, the term z′_(m) ⁽¹⁾ representing the noise on the carrier of rank m having undergone the implemented equalization process.

FIG. 2 depicts an example of a spectral amplitude response of a transmission channel of an MC-CDMA transmission system of which the number of sub-carriers f₁ to f₈ is 8. The amplitudes of the received signals for these frequencies f₁ to f₈ are respectively α, α, γ, γ, β, β, δ and δ.

The spreading sequence of the user 1 is the following Walsh-Hadamard sequence of length 8: c ⁽¹⁾=(+1, +1, +1, +1, +1, +1, +1, +1)

After passing through the channel, whose contribution is assumed here to be limited to its only real component (which consists of considering a perfect equalization of the phase distortion), the impact on the sequence of the user 1 is written: h′ ⁽¹⁾ c ⁽¹⁾=(+α, +α, +γ, +γ, +β, +β, +δ, +δ)

The sequence c⁽¹⁾ being used and the length of the sequences being 8, 7 other sequences orthogonal to the sequence c⁽¹⁾ remain available.

If it is the sequence c⁽²⁾=(+1, −1, +1, −1, +1, −1, +1, −1) which is assigned to the second user, the signal received by the first user is: $\begin{matrix} {v^{(1)} = {{d^{(1)}{\sum\limits_{m = 1}^{N}h_{m}^{\prime{(1)}}}} + {d^{(2)}{\sum\limits_{m = 1}^{N}{h_{m}^{\prime{(1)}}c_{m}^{(1)}c_{m}^{(2)}}}} + {\sum\limits_{m = 1}^{N}z_{m}^{\prime{(1)}}}}} \\ {= {{2\left( {\alpha + \beta + \gamma + \delta} \right)d^{(1)}} + {\left( {{\alpha \cdot 0} + {\beta \cdot 0} + {\gamma \cdot 0} + {\delta \cdot 0}} \right)d^{(2)}} + {\sum\limits_{m = 1}^{N}z_{m}^{\prime{(1)}}}}} \\ {= {{2\left( {\alpha + \beta + \gamma + \delta} \right)d^{(1)}} + {\sum z_{m}^{\prime{(1)}}}}} \end{matrix}$

It may be noted that the estimate of the data d⁽¹⁾ of the user 1 does not depend on the data of the second user.

On the other hand, if it is the sequence c⁽³⁾=(+1, +1, −1, −1, +1, +1, −1, −1) which is assigned to the second user, the signal received by the first user is: $\begin{matrix} {v^{(1)} = {{d^{(1)}{\sum\limits_{m = 1}^{N}h_{m}^{\prime{(1)}}}} + {d^{(3)}{\sum\limits_{m = 1}^{N}{h_{m}^{\prime{(1)}}c_{m}^{(1)}c_{m}^{(3)}}}} + {\sum\limits_{m = 1}^{N}z_{m}^{\prime{(1)}}}}} \\ {= {{2\left( {\alpha + \beta + \gamma + \delta} \right)d^{(1)}} + {2\left( {\alpha - \beta + \gamma - \delta} \right)d^{(3)}} + {\sum\limits_{m = 1}^{N}z_{m}^{\prime{(1)}}}}} \end{matrix}$

It should then be noted that the estimate of the data d⁽¹⁾ of the user 1 this time depends on the data of the second user.

It is thus shown that, given a propagation channel and a family of spreading sequences with identical intercorrelation properties with no channel degradation, the inter-user interference related to propagation of the signal on multiple paths depends on the choice of spreading sequences used from among this family.

Thus, the choice of a particular sequence depending on those which have already been assigned makes it possible to optimize the performance of the transmission system. But this choice can also be made by taking into account the sequences liable to be used later, thus making it possible to optimize, in the future, the performance of the transmission system.

Assigning of the spreading sequences can be uniform to all users and, in this case, it makes it possible to optimize an average quality of transmission performance for all active users.

On the contrary it can also be non-uniform and, in this case, it makes it possible to optimize the transmission of certain sequences with respect to others, and thus differentiate these sequences, for example in terms of quality of service or some other criterion.

In the case of uniform assigning and according to one characteristic of the present invention, there is assigned to a user, from among all the spreading sequences available at the instant of this assigning, the spreading sequence c^((i)) which minimizes a function J^((j,Ω) ^(k) ⁾, referred to as the cost function, representing the interference between the spreading sequence c^((i)) and the spreading sequences c^((k)) of a predetermined or given set of sequences whose indices belong to the set of indices Ω_(k). Thus, the sequence of rank i is assigned if this rank i verifies the following relationship: $i = {\arg\limits_{j}{\min\limits_{{j \in \Omega_{j}},{j \notin \Omega_{k}}}\left\lfloor J^{({j,\Omega_{k}})} \right\rfloor}}$

-   -   where Ω_(j) is the set of the indices of the available         sequences.

For example, the cost function J^((j,Ω) ^(k) ⁾ representing the interference between the spreading sequence c^((j)) and sequences whose indices belong to a set Ω_(k) can be defined as being equal to the maximum value taken by a function D^((j,k)) representing the degradation of the transmission which is induced as a result of the interference between the spreading sequence of index j and the spreading sequence c^((k)) of indices k, for an index k belonging to the predetermined set Ω_(k): $J^{({j,\Omega_{k}})} = {\max\limits_{k \in \Omega_{k}}D^{({j,k})}}$

The cost function could also be equal to the mean of the values taken by this degradation function: $J^{({j,\Omega_{k}})} = {\frac{1}{K}{\sum\limits_{k \in \Omega_{k}}D^{({j,k})}}}$

-   -   where K is the number of indices in the predetermined set Ω_(k).

For example, the degradation function D^((j,k)) is defined as follows: $D^{({j,k})} = {{{E\left\lbrack \left( {\sum\limits_{m = 1}^{M}{h_{m}^{\prime{(j)}}c_{m}^{(j)}c_{m}^{(k)}}} \right)^{2} \right\rbrack}\mspace{14mu}{or}\mspace{14mu} D^{({j,k})}} = {E\left\lbrack \left( {\sum\limits_{m = 1}^{M}{h_{m}^{\prime{(k)}}c_{m}^{(j)}c_{m}^{(k)}}} \right)^{2} \right\rbrack}}$

-   -   where E is the mathematical expectation.

It should be noted here that M is the number of sub-carriers used in the MC-CDMA transmission system and h′_(m) ^((j)) is either the response of the transmission channel (also denoted h_(m) ^((j)) in the introduction to the present description), or the apparent response of the transmission channel in view of an equalization process implemented in the receiver, the response for the frequency of the sub-carrier of rank m and for the receiver of the user of the sequence of rank j.

Another possibility is to choose D^((j,k)) as representing the small size of the high-frequency components of a sequence X^((j,k)) of N elements resulting from the element-by-element product of the sequence c^((j)) and the sequence c^((k)). In particular, the more numerous the high-frequency components of this sequence X^((j,kj)), the smaller the degradation function D^((j,k)).

The size of the high-frequency components compared with the other components can be measured using a Fourier transform.

It can also be measured by considering the number of {+1,−1} and {−1,+1} transitions appearing in the sequence X^((j,k)). This will then give, for example: D ^((j,k))=1/T(X ^((j,k)))

-   -   where T(X^((j,k))) is the number of transitions in the sequence         X^((j,k)) resulting from the element-by-element product of the         sequence c^((j)) and the sequence c^((k)).

There is a transition between the m-th element and the m+1-th element of X^((i,j)) if: Sgn[X_(m) ^((i,j))]≠Sgn[X_(m+1) ^((i,j))]

It should be noted that the number of transitions in the product sequences X^((j,k)) is generally known in advance and depends on the family of sequences used by the transmission system: Walsh-Hadamard sequences, Gold sequences, Kasami sequences, etc. This number can be calculated in advance and stored in a memory table for each sequence and for all the product sequences of this sequence.

There will now be illustrated the implementation of the method of the present invention where the cost function J^((j,Ω) _(k) ⁾ is equal to the maximum value taken by the degradation function $\left( {J^{({j,\Omega_{k}})} = {\max\limits_{k \in \Omega_{k}}D^{({j,k})}}} \right)$ and the said degradation function is equal to the inverse of the number of transitions in the sequence X^((j,k)) resulting from the element-by-element product of the sequence c^((j)) and the sequence c^((k)).

FIG. 3 depicts a table giving respectively along the x and y axes the rank of Walsh-Hadamard sequences and, at the intersection of a line and a column, the number of transitions in the sequence which is the element-by-element product of the two sequences respectively assigned to the said line and to the said column.

Let it be considered for an instant where only the sequences of rank 1 and 6 are used. Determination of the sequence to be assigned to the next user will be carried out by considering a predetermined set equal to the set of the sequences already used. The values of j are therefore equal to 1 and 6. For i=2, the numbers of T(X^((2,1))) and T(X^((2,6))) transitions are respectively equal to 7 and 1. The maximum value of the degradation is therefore 1.

For i=3, the numbers of T(X^((3,1))) and T(X^((3,6))) transitions are respectively equal to 3 and 5. The maximum value of the degradation is therefore ⅓.

For i=4, the numbers of T(X^((4,1))) and T(X^((4,6))) transitions are respectively equal to 4 and 2. The maximum value of the degradation is therefore ½.

The same procedure is carried out for the other values of i. The list of the maximum values of the degradation (or cost) is therefore

i 2 3 4 5 7 8 J^((j,Ω) ^(k) ⁾ 1 ⅓ ½ 1 ½ ⅓

The spreading sequence for which the value of the cost J^((j,Ω) ^(k) ⁾ is a minimum is then chosen. Here, two sequences can be chosen: 3 and 8. The choice between the two can be arbitrary or not.

According to the present invention, there is assigned, to each user, at least one spreading sequence so as to take into account the transmission quality envisaged for this sequence or these sequences. The assigning is then referred to as non-uniform.

For example, to a user desiring a good relative transmission quality, there is assigned the spreading sequence c^((i)) which minimizes the cost function J^((j,Ω) ^(k) ⁾ with the spreading sequences c^((k)) of a predetermined or given set of sequences of index k belonging to a set Ω_(k). To a user desiring an average transmission quality, there is assigned the spreading sequence c^((i)) which gives an average value to the cost function J^((j,Ω) ^(k) ⁾ with the spreading sequences c^((k)) of a predetermined or given set of sequences of index k belonging to a set Ω_(k). As for a user whose transmission quality can be a minimum, there can be assigned the spreading sequence c^((i)) without worrying about the distortion on this sequence.

According to the present invention, there is assigned to each user at least one spreading sequence so as to take into account the transmission quality envisaged for the sequences belonging to a predetermined set of sequences.

In this case, the predetermined set of spreading sequences c^((k)) of indices k belonging to a set Ω_(k) under consideration at the instant of the assigning of a sequence can be composed of the spreading sequences which are already used at the instant of this assigning.

In this case, given a number K of previously used spreading sequences, the rule for assigning a new sequence consists of allocating, from among the available spreading sequences, the spreading sequence c^((i)) which minimizes the cost function J^((j,Ω) ^(k) ⁾ representing the interference between the spreading sequence c^((i)) and the K already used spreading sequences c^((k)) of indices k belonging to the set Ω_(k). $i = {{\arg\limits_{j}\mspace{31mu}{\min\limits_{j \in \Omega_{j}}{\left\lfloor J^{({j,\Omega_{k}})} \right\rfloor\mspace{31mu}{for}\mspace{14mu} K}}} \geq 2}$

The predetermined set of sequences c^((k)) can also be composed of the spreading sequences which are potentially usable in the future, alone or in combination with the preceding sequences. This may be the case at any instant, but also at the time of the assigning of the first spreading sequence.

The rule for assigning the first spreading sequence consists of allocating, from among the available spreading sequences, the spreading sequence c^((i)) which minimizes the cost function J^((j,Ω) ^(k) ⁾ representing the interference between the spreading sequence i and the spreading sequences c^((k)) potentially usable in the future of indices k belonging to the set Ω_(k). The i-th spreading sequence c^((i)) is assigned if: $i = {\arg\limits_{j}\mspace{31mu}{\min\limits_{j \in \Omega_{j}}\left\lfloor J^{({j,\Omega_{k}})} \right\rfloor}}$

-   -   where Ω_(j) is the set of the indices of the available         sequences.

The rule for assigning a new spreading sequence can also favour the transmission of an already assigned sequence i₀. The predetermined set of spreading sequences is then composed of this single sequence.

Thus, given a number K of previously assigned spreading sequences comprising the sequence c^((i) ⁰ ⁾, the rule for assigning a new sequence consists of allocating, from among the available sequences, the spreading sequence c^((i)) which minimizes the cost function J^((i,i) ⁰ ⁾ representing the interference between the spreading sequence i and the spreading sequence c^((i) ⁰ ⁾ whose transmission it is necessary to favour. The i-th spreading sequence c^((i)) is assigned if: ${i = {{\arg\limits_{j}\mspace{31mu}{\min\limits_{j \in \Omega_{j}}{\left\lfloor J^{({j,i_{0}})} \right\rfloor\mspace{31mu}{for}\mspace{14mu} i_{0}}}} \in \Omega}},{j \neq i_{0}},{K \geq 2}$

According to another characteristic of the present invention, the method of the present invention consists of re-assigning during transmission, at given instants, the K-Q sequences still necessary for the different transmissions, K being the number of spreading sequences used previously before Q sequences from among K (Q<K) were made available (for example following the deactivation of a user).

The rules which underlie the re-assigning process are the same as those of the process for assigning to a user at the instant when the latter initiates a communication.

More particularly, this process can be as follows. If K-Q>1, in order to satisfy a re-assigning of the spreading sequences which provides a uniform optimization of the performances, this dynamic re-assigning can consist of:

Calculating the cost functions J^((j,Ω) ^(k) ⁾ for any spreading sequence c^((j)) where j belongs to the set Ω_(Q) of the indices of the sequences made available.

Calculating the cost functions J^((k,Ω) ^(k) ⁾ for any spreading sequence c^((k)) where k belongs to Ω_(K-Q) of the indices of the sequences still used.

As long as there exists one or more spreading sequences of index j₀εΩ_(Q) and one or more spreading sequences of index k₀εΩ_(K-Q) such that J^((j) ⁰ ^(,Ω) ^(k) ⁾<J^((k) ⁰ ^(,Ω) ^(k) ⁾, de-allocating the sequence c^((k) ^(M) ⁾ defined by: ${k_{M} = {\arg\limits_{k}\mspace{31mu}{\max\limits_{k \in \Omega_{K - Q}}\left\lfloor J^{({k,\Omega_{k}^{\prime}})} \right\rfloor}}},$

-   -   and allocating instead the sequence c^((k) ^(m) ⁾ defined by:         $k_{m} = {\arg\limits_{k}\mspace{31mu}{\min\limits_{k \in \Omega_{Q}}\left\lfloor J^{({k,\Omega_{k}})} \right\rfloor}}$

According to another example, if K-Q>1 and in order to satisfy a re-assigning of the spreading sequences which would favour the transmission of the already assigned sequence i₀, the dynamic re-assigning can consist of:

Calculating the cost functions J^((j,j) ⁰ ⁾ for any spreading sequence c^((j)) where j belongs to the set Ω_(Q) of the indices of the sequences made available.

Calculating the cost functions J^((k,j) ⁰ ⁾ for any spreading sequence c^((k)) where k belongs to Ω_(K-Q) of the indices of the sequences still used.

As long as there exists one or more spreading sequences of index j₀εΩ_(Q) and one or more spreading sequences of index k₀εΩ_(K-Q) such that J^((j) ⁰ ^(,i) ⁰ ⁾<J^((k) ⁰ ^(,i) ⁰ ⁾, de-allocating the sequence c^((k) ^(M) ⁾ defined by: ${k_{M} = {\arg\limits_{k}\mspace{31mu}{\max\limits_{k \in \Omega_{K - Q}}\left\lfloor J^{({k,i_{0}})} \right\rfloor}}},$

-   -   and allocating instead the sequence c^((k) ^(m) ⁾ defined by:         $k_{m} = {\arg\limits_{k}\mspace{31mu}{\min\limits_{k \in \Omega_{Q}}\left\lfloor J^{({k,i_{0}})} \right\rfloor}}$ 

1. Method of assigning one or more spreading sequences among a family of spreading sequences to a user of a Multi-Carrier Code Division Multiple Access transmission network, each element of said sequence being, at the level of a transmitter of said network, multiplied by a data item to be transmitted and then transmitted on a corresponding sub-carrier, comprising: assigning, to said user, said one or more spreading sequences; and minimizing a function representing the interference between said one or more sequences, on the one hand, and spreading sequences of a predetermined set, on the other hand, said predetermined set being included in said family of spreading sequences; wherein the minimizing function dynamically selects the best sequences from the predetermined set of spreading sequences in the family of spreading sequences as the number of needed sequences changes, and the number of selected sequences is less than or equal to the total number of spreading sequences.
 2. A method according to claim 1 wherein the predetermined set of spreading sequences includes the set of sequences which are used by the network at the instant of assigning.
 3. A method according to claim 1 wherein the predetermined set of spreading sequences includes the set of sequences which are potentially usable after the instant of assigning.
 4. A method according to claim 1 wherein said set of spreading sequences includes a favored set of spreading sequences.
 5. A method according to claim 1 which further includes allocating, from among all the spreading sequences available at the instant of the assigning, the spreading sequence c^((i)) which minimizes a function J^((i,Ω) ^(k) ⁾ representing the interference between the spreading sequence c^((i)) and the spreading sequences of the predetermined or given set, the sequence of rank i thus being assigned if this rank i verifies the following relationship: $i = {\arg\limits_{j}\mspace{31mu}{\min\limits_{{j \in \Omega_{j}},{j \notin \Omega_{k}}}\left\lbrack J^{({j,\Omega_{k}})} \right\rbrack}}$ where Ω_(k) is the set of the indices of the sequences of the predetermined or given set and Ω_(j) is the set of the indices of the available sequences.
 6. A method according to claim 1 wherein each user is assigned a spreading sequence so as to take into account the transmission quality envisaged for the spreading sequence.
 7. A method according to claim 6, wherein the user is assigned a spreading sequence c^((i)) which minimizes the cost function J^((i,Ω) ^(k) ⁾ with the spreading sequences c^((k)) of a predetermined or given set of sequences of index k belonging to a set Ω_(k), to a user desiring an average transmission quality, the spreading sequence c^((i)) which gives an average value to the cost function J^((i,Ω) ^(k) ⁾ with the spreading sequences c^((k)) of a predetermined or given set of sequences of index k belonging to a set Ω_(k), and to a user whose transmission quality can be a minimum, a spreading sequence c^((i)).
 8. A method according to claim 5, characterized in that the cost function J^((i,Ω) ^(k) ⁾ representing the interference between the spreading sequence c^((i)) and sequences c^((k)) of indices k belonging to a set Ω_(k), is defined as being equal to the maximum value taken by a function D^((j,k)) representing the degradation of the transmission which is induced as a result of the interference between the spreading sequence c^((j)) and the spreading sequence c^((k)): $J^{({j,\Omega_{k}})} = {\max\limits_{k \in \Omega_{k}}{D^{({j,k})}.}}$
 9. A method according to claim 5 wherein the cost function J^((j,Ω) ^(k) ⁾ representing the interference between the spreading sequence c^((j)) and K sequences c^((k)) of indices k belonging to a set Ω_(k), is defined as being equal to the average of the values taken by a function D^((j,k)) representing the degradation of the transmission which is induced as a result of the interference between the spreading sequence c^((j)) and the sequence c^((k)): $J^{({j,\Omega_{k}})} = {\frac{1}{K}{\sum\limits_{k \in \Omega_{k}}{D^{({j,k})}.}}}$
 10. A method according to claim 8 wherein the degradation function D^((j,k)) is defined as follows: $D^{({j,k})} = {{{E\left\lbrack \left( {\sum\limits_{m = 1}^{M}{h_{m}^{\prime{(j)}}c_{m}^{(j)}c_{m}^{(k)}}} \right)^{2} \right\rbrack}\mspace{14mu}{or}\mspace{14mu} D^{({j,k})}} = {E\left\lbrack \left( {\sum\limits_{m = 1}^{M}{h_{m}^{\prime{(k)}}c_{m}^{(j)}c_{m}^{(k)}}} \right)^{2} \right\rbrack}}$ where E is the mathematical expectation, M the number of sub-carriers used in the MC-CDMA transmission system and h′_(m) ^((j)) is the apparent response of the transmission channel in view of an equalization process implemented in the receiver, the response for the frequency of the sub-carrier of rank m and for the receiver of the user of the sequence of rank j.
 11. A method according to claim 8 wherein the degradation function D^((j,k)) represents the small size of the high-frequency components of a sequence X^((j,k)) of N elements resulting from the element-by-element product of the sequence c^((j)) and the sequence c^((k)).
 12. A method according to claim to claim 11 wherein the value of the degradation function D^((j,k)) is given by the application of a Fourier transform to the sequence X^((j,k)) of N elements resulting from the element-by-element product of the sequence c^((j)) and the sequence c^((k)).
 13. A method according to claim 11 wherein the value of the degradation function D^((j,k)) is given by the number of {+1,−1} and {+1,−1} transitions appearing in the sequence X^((j,k)) of N elements resulting from the element-by-element product of the sequence c^((j)) and the sequence c^((k)).
 14. A method according to claim to claim 1 wherein the method is implemented dynamically and includes re-assigning during transmission, at predetermined instants, the K-Q sequences still necessary for the different transmissions, K being the number of spreading sequences used previously before Q sequences from among K(Q<K) were made available.
 15. A method according to claim 14 which further includes; calculating the cost functions J^((j,Ω) ^(k) ⁾ for any spreading sequence c^((j)) where j belongs to the set Ω_(Q) of the indices of the sequences made available, calculating the cost functions J^((j,Ω) ^(k) ⁾ for any spreading sequence c^((k)) where k belongs to the set Ω_(K-Q) of the indices of the sequences still used, as long as there exists one or more spreading sequences of index j₀εΩ_(Q) and one or more spreading sequences of index k₀εΩ_(K-Q) such that J^((j) ⁰ ^(,Ω) ^(k) ⁾<J^((k) ⁰ ^(,Ω) ^(k) ⁾ de-allocating the sequence c^((k) ^(M) ⁾ defined by: ${k_{M} = {\arg\limits_{k}\mspace{25mu}{\max\limits_{k \in \Omega_{K - Q}}\left\lbrack J^{({k,\Omega_{k}})} \right\rbrack}}},$ and allocating instead the sequence c^((k) ^(M) ⁾ defined by: $k_{m} = {\arg\limits_{k}\mspace{31mu}{\max\limits_{k \in \Omega_{Q}}{\left\lbrack J^{({k,\Omega_{k}})} \right\rbrack.}}}$
 16. Assigning method according to claim 14, which further includes; calculating the cost functions J^((j,i) ⁰ ⁾ for any spreading sequence c^((j)) where j belongs to the set Ω_(Q) of the indices of the sequences made available, calculating the cost functions J^((k,i) ⁰ ⁾ for any spreading sequence c^((k)) where k belongs to the set Ω_(K-Q) of the indices of the sequences still used, as long as there exists one or more spreading sequences of index j₀εΩ_(Q) and one or more spreading sequences of index k₀εΩ_(K-Q) such that J^((j) ⁰ ^(,i) ⁰ ⁾<J^((k) ⁰ ^(,i) ⁰ ⁾, de-allocating the sequence c^((k) ^(M) ⁾ defined by: ${k_{M} = {\arg\limits_{k}\mspace{31mu}{\max\limits_{k \in \Omega_{K - Q}}\left\lbrack J^{({k,i_{o}})} \right\rbrack}}},$ and allocating instead the sequence c^((k) ^(m) ⁾ defined by: $k_{m} = {\arg\limits_{k}\mspace{31mu}{\min\limits_{k \in \Omega_{Q}}{\left\lbrack J^{({k,i_{o}})} \right\rbrack.}}}$
 17. A transmitter for a Multi-Carrier Code Division Multiple Access transmission system, that assigns one or more spreading sequences among a family of spreading sequences to a user of a Multi-Carrier Code Division Multiple Access transmission network, each element of said sequence being, at the level of a transmitter of said network, multiplied by a data item to be transmitted and then transmitted on a corresponding sub-carrier, the transmitter comprising: means for assigning, to said user, said one or more spreading sequences; and means for minimizing a function representing the interference between said one or more sequences, on the one hand, and spreading sequences of a predetermined set, on the other hand, said predetermined set being included in said family of spreading sequences wherein the means for minimizing a function dynamically selects the best sequences from the predetermined set of spreading sequences in the family of spreading sequences as the number of needed sequences changes, and the number of selected sequences is less than or equal to the total number of spreading sequences. 